Weighing matrices and spherical codes
نویسندگان
چکیده
Mutually unbiased weighing matrices (MUWM) are closely related to an antipodal spherical code with 4 angles. In this paper, we clarify the relation between MUWM and the spherical codes, and determine the maximum size of a set of MUWM with weight 4 for any order. Moreover, we define mutually quasi-unbiased weighing matrices (MQUWM) as a natural generalization of MUWM from the viewpoint of spherical codes. We determine the maximum size of a set of MQUWM for the parameters (d, 2, 4, 1) and (d, d, d/2, 2d). This includes an affirmative answer to the problem of Best, Kharaghani, and Ramp.
منابع مشابه
On binary codes related to mutually quasi-unbiased weighing matrices
Some mutually quasi-unbiased weighing matrices are constructed from binary codes satisfying the conditions that the number of non-zero weights of the code is four and the code contains the first order Reed–Muller code. Motivated by this, in this note, we study binary codes satisfying the conditions. The weight distributions of binary codes satisfying the conditions are determined. We also give ...
متن کاملOn the Classification of Weighing Matrices and Self-Orthogonal Codes
We provide a classification method of weighing matrices based on a classification of self-orthogonal codes. Using this method, we classify weighing matrices of orders up to 15 and order 17, by revising some known classification. In addition, we give a revised classification of weighing matrices of weight 5. A revised classification of ternary maximal self-orthogonal codes of lengths 18 and 19 i...
متن کاملSelf-Dual codes from $(-1, 1)$-matrices of skew symmetric type
Abstract. Previously, self-dual codes have been constructed from weighing matrices, and in particular from conference matrices (skew and symmetric). In this paper, codes constructed from matrices of skew symmetric type whose determinants reach the EhlichWojtas’ bound are presented. A necessary and sufficient condition for these codes to be self-dual is given, and examples are provided for lengt...
متن کاملNew extremal ternary self-dual codes
Compared to binary self-dual codes, few methods are known to construct ternary self-dual codes. In this paper, a construction method for ternary self-dual codes is presented. Using this method, a number of new extremal ternary self-dual codes are obtained from weighing matrices. In addition, a classification is given for extremal ternary self-dual codes of length 40 constructed from Hadamard ma...
متن کاملSome Optimal Codes From Designs
The binary and ternary codes spanned by the rows of the point by block incidence matrices of some 2-designs and their complementary and orthogonal designs are studied. A new method is also introduced to study optimal codes.
متن کامل